$NP/CMP$ Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$ Minimization and $l_{p}$ Minimization for Information Processing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

$NP/CLP$ Equivalence: A Phenomenon Hidden Among Sparsity Models for Information Processing

It is proved in this paper that to every underdetermined linear system Ax = b there corresponds a constant p(A, b) > 0 such that every solution to the lp-norm minimization problem also solves the l0-norm minimization problem whenever 0 < p < p(A, b). This phenomenon is named NP/CLP equivalence.

متن کامل

When is P such that l_0-minimization Equals to l_p-minimization

In this paper, we present an analysis expression of p∗(A, b) such that the unique solution to l0-minimization also can be the unique solution to lp-minimization for any 0 < p < p ∗(A, b). Furthermore, the main contribution of this paper isn’t only the analysis expressed of such p∗(A, b) but also its proof. Finally, we display the results of two examples to confirm the validity of our conclusion...

متن کامل

Minimization for Information Processing

In this paper, we have proved that in every underdetermined linear system Ax = b there corresponds a constant p∗(A, b) > 0 such that every solution to the lp-norm minimization problem also solves the l0-norm minimization problem whenever 0 < p < p∗(A, b). This phenomenon is named NP/CMP equivalence.

متن کامل

L_0-norm Minimization for Basis Selection

Finding the sparsest, or minimum l0-norm, representation of a signal given an overcomplete dictionary of basis vectors is an important problem in many application domains. Unfortunately, the required optimization problem is often intractable because there is a combinatorial increase in the number of local minima as the number of candidate basis vectors increases. This deficiency has prompted mo...

متن کامل

Saliency Detection via Nonlocal L_0 Minimization

In this paper, by observing the intrinsic sparsity of saliency map for the image, we propose a novel nonlocal L0 minimization framework to extract the sparse geometric structure of the saliency maps for the natural images. Specifically, we first propose to use the k-nearest neighbors of superpixels to construct a graph in the feature space. The novel L0-regularized nonlocal minimization model i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2015

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2015.2429611